Randomized Fuzzy Cell Hough Transform
نویسندگان
چکیده
Randomized Hough Transform (RHT) has been recently proposed as a new and eecient variation of the Hough Transform for curve detection. In this paper the RHT is combined with the Fuzzy Cell Hough Transform (FCHT) and a new variation, the Randomized Fuzzy Cell Hough Transform (RFCHT) is proposed. The p-dimensional parameter space of Hough Transform is split into fuzzy cells with overlapped intervals of con-dence. The fuzzy cells are deened as fuzzy numbers. The RFCHT selects p pixels from an edge image by random sampling and solves the p parameters of a curve. Then the p parameters accumulate to more than one fuzzy cells, since the fuzzy cells intervals are overlapped, by adding a value that belongs in the interval 0; 1] and is calculated from the membership function of the corresponding fuzzy cell. The procedure continues by using a percentage of the total contour pixels. The RFCHT algorithm preserves the advantages of RHT and FCHT. The algorithm has good computational speed and small storage requirements due to random sampling and correct and more accurate detections, especially in noisy images, due to fuzzy cells.
منابع مشابه
Fuzzy cell Hough transform for curve detection
In this paper a new variation of Hough Transform is proposed. It can be used to detect shapes or contours in an image, with better accuracy, especially in noisy images. The parameter space of Hough Transform is split into fuzzy cells which are de ned as fuzzy numbers. This fuzzy split provides the advantage to use the uncertainty of the contour point location which is increased when noisy image...
متن کاملConnective Randomized Hough Transform (crht)
A new branch of Hough Transform algorithms, called probabilistic Hough Transforms, has been actively developed in recent years. One of the rst was a new and eecient probabilistic version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT). The RHT picks n pixels from an edge image by random sampling to solve n parameters of a curve and then accumulates only one cell...
متن کاملA Fast Randomized Generalized Hough Transform for Arbitrary Shape Detection
The well-known arbitrary shape detection technology, generalized Hough transform (GHT) has the drawbacks of heavy computations (one-to-many or 1-to-n mapping) and storage requirements (voting space and entry number). Some n-to-1 mapping approaches have been proposed for improving the performance of GHT, such as the FGHT (fast generalized Hough transform), ADPHT (Adaptive dual-point Hough transf...
متن کاملFuzzy Hough Transform, Linguistic Sets and Soft Decision MLP for Character Recognition
We present a neuro-fuzzy system for character recognition from printed documents using a fuzzy Hough transform technique. For each character pattern, fuzzy Hough transform extracts information from the standard Hough transform accumulator cells into a number of fuzzy sets. These basic fuzzy sets are combined by t-norms to synthesize additional fuzzy sets whose heights form an n-dimensional feat...
متن کاملRandomized generalized Hough transform for 2-D gray scale object detection
This paper proposes a new algorithm for 2-D object detection called Randomized Generalized Hough Transform (RGHT). It combines the Generalized Hough Transform (GHT) with the Randomized Hough Transform (RHT). Our algorithm can detect arbitrary objects of various scales and orientations in graylevel images. We also demonstrate RGHT’s advantage of high speed, low storage requirement, high accuracy...
متن کامل